#include<iostream>
#include<algorithm>
using namespace std;
const int N = 110;
int arr[N];
int f[N], g[N];
int n;
int main()
{
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> arr[i];
	}
	for (int i = 1; i <= n; i++) {
		f[i] = 1;
		for (int j = 1; j < i; j++) {
			if (arr[i] > arr[j]) {
				f[i] = max(f[i], f[j] + 1);
			}
		}
	}
	for (int i = n; i; i--) {
		g[i] = 1;
		for (int j = n; j; j--) {
			if (arr[i] > arr[j]) {
				g[i] = max(g[i], g[j] + 1);
			}
		}
	}
	int ans = 0;
	for (int i = 1; i <= n; i++) {
		ans = max(ans, f[i] + g[i] - 1);
	}
	cout << n - ans << endl;
	return 0;
}